Pii: S0925-7721(01)00017-7
نویسندگان
چکیده
The medial axis transform (or MAT) is a representation of an object as an infinite union of balls. We consider approximating the MAT of a three-dimensional object, and its complement, with a finite union of balls. Using this approximate MAT we define a new piecewise-linear approximation to the object surface, which we call the power crust. We assume that we are given as input a sufficiently dense sample of points from the object surface. We select a subset of the Voronoi balls of the sample, the polar balls, as the union of balls representation. We bound the geometric error of the union, and of the corresponding power crust, and show that both representations are topologically correct as well. Thus, our results provide a new algorithm for surface reconstruction from sample points. By construction, the power crust is always the boundary of a polyhedral solid, so we avoid the polygonization, hole-filling or manifold extraction steps used in previous algorithms. The union of balls representation and the power crust have corresponding piecewise-linear dual representations, which in some sense approximate the medial axis. We show a geometric relationship between these duals and the medial axis by proving that, as the sampling density goes to infinity, the set of poles, the centers of the polar balls, converges to the medial axis. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
A (1+)-approximation algorithm for 2-line-center
We consider the following instance of projective clustering, known as the 2-line-center problem: Given a set S of n points in R2, cover S by two congruent strips of minimum width. Algorithms that find the optimal solution for this problem have near-quadratic running time. In this paper we present an algorithm that, for any ε > 0, computes in time O(n(logn+ ε−2 log(1/ε))+ ε−7/2 log(1/ε)) a cover...
متن کاملThe power crust, unions of balls, and the medial axis transform
The medial axis transform (or MAT) is a representation of an object as an in nite union of balls. We consider approximating the MAT of a three-dimensional object, and its complement, with a nite union of balls. Using this approximate MAT we de ne a new piecewise-linear approximation to the object surface, which we call the power crust. We assume that we are given as input a suÆciently dense sam...
متن کاملPii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کاملSOKOBAN and other motion planning problems
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملPii: S0925-7721(01)00068-2
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n logn) time. 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001